Decidable first-order transition logics for PA-processes
ثبت نشده
چکیده
منابع مشابه
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizability by tree automata of the reachability relation. The tree automata approach and the transition logics we use allow a smooth and general treatment of parameterized model checking for PA. This approach is extended to h...
متن کاملFixpoint Extensions of Temporal Description Logics
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Description Logics to obtain decidability and tight complexity results for temporal fixpoint extensions of these Description Logics and more generally for the decidable monodic fragments of first order logic.
متن کاملA Survey of Decidable First-Order Fragments and Description Logics
The guarded fragment and its extensions and subfragments are often considered as a framework for investigating the properties of description logics. There are also other, some less well-known, decidable fragments of first-order logic which all have in common that they generalise the standard translation of ALC to first-order logic. We provide a short survey of some of these fragments and motiva...
متن کاملOn the relationship between decidable fragments, non-classical logics, and description logics
The guarded fragment [1] and its extensions and subfragments have often been considered as a framework for investigating the properties of description logics [8, 18]. But there are other decidable fragments which all have in common that they generalise the standard translation of ALC to first-order logic. We provide a short survey of some of these fragments and motivate why they are interesting...
متن کاملThe Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs it is important to have some version of a transitive closure operator so that we can describe such notions as the set of nodes reachable from a program’s variables. On the other hand, with a few notable exceptions, adding transitive closure to even very tame logics makes them undecidable. In this paper we explore the boundary between decidability and undecid...
متن کامل